Grover’s Algorithm and the Evolutionary Approach of Quantum Computation
نویسندگان
چکیده
In the recent years we were witnesses of an intense research activity, trying to find some common ground for quantum computation and genetic programming [4][19]. The use of genetic algorithms provides outstanding means for automated synthesis of quantum circuits. In this paper we focus on the opportunity of designing so-called Quantum Genetic Algorithms or QGAs. As the qubit representation of the chromosomes provides the possibility of representing the entire population with just one quantum superposition state, a quantum state can be generated as a superposition of all the corresponding fitness values. By marking the superposed chromosome that dictates the best fitness value, one only needs to apply Grover’s algorithm in order to return the solution of the search. We also present the implementation details of the proposed procedure, along with an illustrating example.
منابع مشابه
A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملShortening Grover’s Search Algorithm for an Expectation Value Quantum Computer
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value i...
متن کاملQuantum Searching: A survey of Grover’s Algorithm and its Descendants
One of computer science’s classic problems is that of the search. This paper will look at Lou K. Grover’s Quantum Search algorithm. This algorithm is used to search a database, or search space, that is not, and cannot be, sorted or structured. It can produce a quadratic speed up over any similar classical search. This paper will also look at some of the issues and advances that have come out of...
متن کاملSimilarity between Grover’s quantum search algorithm and classical two-body collisions
By studying the diffusion operator in Grover’s quantum search algorithm, we find a mathematical analogy between quantum searching and classical, elastic two-body collisions. We exploit this analogy using a thought experiment involving multiple collisions between two-bodies to help illuminate why Grover’s quantum search algorithm works. Related issues are discussed. PACS numbers: 03.67. Quantum ...
متن کاملEvolutionary Computation in Coded Communications: An Implementation of Viterbi Algorithm
Quantum Computing hopefully is the future of computing systems. It still on its first steps. The development of some quantum algorithms gives the quantum computing a boost on its importance. These algorithms (such as Shor’s and Grover’s algorithms) proved to have superior performance over classical algorithms [1-4]. The recent findings, that quantum error correction can be used, showed that the...
متن کامل